Saturation number of nanotubes
نویسندگان
چکیده
منابع مشابه
On the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملInduced saturation number
In this paper, we discuss the induced saturation number. It is a nice generalization of the saturation number that will allow us to consider induced subgraphs. We define the induced saturation number, indsat(n,H), to be the fewest number of gray edges in a trigraph T such that H does not appear in any realization of T , but if a black or white edge of T is flipped to gray then there exists a re...
متن کاملStudy of Saturation and Supersaturation of Zr-Doped Vanadium Oxide Nanotubes
Vanadium oxide nanotubes belong to inorganic nanotubes. One inorganic nanotubes (WS2) synthesized in 1992.Vanadium oxide nanotubes discovared by spahr in 1998.Vanadium oxide nanotubes are used in chemical, bio, electronics and catalysts industry. Many applications of these nanotubes have not yet been discovered. Especially when these nanotubes are doped with different elements. The structure of...
متن کاملIrredundance saturation number of a graph
Let G = (V,E) be a graph and let v ∈ V. Let IRS(v,G) denote the maximum cardinality of an irredundant set in G which contains v. Then IRS(G) = min {IRS(v,G) : v ∈ V } is called the irredundance saturation number of G. In this paper we initiate a study of this parameter.
متن کاملThe Game Saturation Number of a Graph
Given a family F and a host graph H, a graph G ⊆ H is F-saturated relative to H if no subgraph of G lies in F but adding any edge from E(H)−E(G) to G creates such a subgraph. In the F-saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in F , until G becomes F-saturated relative to H. They aim to maximize or minimize the length of the game, respectively...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2017
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1056.ae9